Recurrent graphs where two independent random walks collide finitely
نویسندگان
چکیده
We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from Z 2 by removing all horizontal edges off the x-axis, has this property. We also conjecture that the same property holds for some other graphs, including the incipient infinite cluster for critical percolation in Z 2 .
منابع مشابه
Recurrent graphs where two independent random walks collide finitely often Manjunath Krishnapur and Yuval Peres
We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from Z 2 by removing all horizontal edges off the x-axis, has this property. We also conjecture that the same property holds for some other graphs, including the incipient infinite cluster for critical percolation ...
متن کاملCollisions of random walks and related diffusions
Consider n brownian motion particles on R, S, or n discrete time random walks on a graph G. A ‘collision’ occurs when two particles have the same position at the same time. Given a rule for modeling interactions between particles, we can analyze the long term behavior of such a system. We focus on the case where particles are independent, and briefly discuss : for example, where particles are c...
متن کاملRandom Walks on Directed Covers of Graphs
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still equals the branching number, upper and lower growth rates do not longer coincide in general. Furthermore, the behaviour of random walks on directed covers of infi...
متن کاملLevel Crossing Probabilities Ii: Polygonal Recurrence of Multidimensional Random Walks
In part I (math.PR/0406392) we proved for an arbitrary onedimensional random walk with independent increments that the probability of crossing a level at a given time n is O(n). In higher dimensions we call a random walk ’polygonally recurrent’ (resp. transient) if a.s. infinitely many (resp. finitely many) of the straight lines between two consecutive sites hit a given bounded set. The above e...
متن کاملSome sufficient conditions for infinite collisions of simple random walks on a wedge comb
In this paper, we give some sufficient conditions for the infinite collisions of independent simple random walks on a wedge comb with profile {f(n), n ∈ Z}. One interesting result is that two independent simple random walks on the wedge comb will collide infinitely many times if f(n) has a growth order as n log n. On the other hand, if {f(n);n ∈ Z} are given by i.i.d. non-negative random variab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004